On Parallel Generation of Set Partitions in Associative Processor Architectures
نویسنده
چکیده
In this paper a new parallel algorithm is presented for generation of all m{block partitions of n{element set, 1 m n. Computations run in an associative processor model. Objects are generated in lexicographic order, with O(1) time per object. The algorithm is well suited for column/masks generation in associative processors.
منابع مشابه
Ultra-Low-Energy DSP Processor Design for Many-Core Parallel Applications
Background and Objectives: Digital signal processors are widely used in energy constrained applications in which battery lifetime is a critical concern. Accordingly, designing ultra-low-energy processors is a major concern. In this work and in the first step, we propose a sub-threshold DSP processor. Methods: As our baseline architecture, we use a modified version of an existing ultra-low-power...
متن کاملA New Algorithm for Generation of Exactly M-Block Set Partitions in Associative Model
In this paper a new parallel algorithm is presented for generation of all exactly m{block partitions of n{element set. The basic building blocks of the algorithm are an associative generator of combinations and a complex parallel counter. Consecutive objects are generated in lexicographic order, with O(1) time per object. The algorithm can be used for generation of all partitions within the giv...
متن کاملOn Parallel Generation of Combinations in Associative Processor Architectures
In this paper two new parallel algorithms are presented for generation of (n,k)-combinations. Computations run in associative processor models. Objects are generated in lexicographic order, with O(1) time per object, in two di erent representations. The rst algorithm uses the conventional representation of combinations while the second algorithm generates combinations in the form of binary vect...
متن کاملبهینه سازی زمان بندی الگوریتم های موازی با استفاده از الگوریتم ژنتیک
In scheduling, a set of machines in parallel is a setting that is important, from both the theoretical and practical points of view. From the theoretical viewpoint, it is a generalization of the single machine scheduling problem. From the practical point of view the occurrence of resources in parallel is common in real-world. When machines are computers, a parallel program can be conceived as a...
متن کاملA Scalable Pipelined Associative SIMD Array with Reconfigurable PE Interconnection Network for Embedded Applications
This paper describes the FPGA implementation of a specialized SIMD processor array for embedded applications. An alternative to traditional SoC or MPSoC architectures, this array combines the massive parallelism inherent in SIMD architectures with the search capabilities of associative computing, producing a SIMD Processor Array System on a Chip (PASoC) well suited for applications such as data...
متن کامل